Community Structure in Directed Networks
نویسندگان
چکیده
منابع مشابه
Community Identification in Directed Networks
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht and Newman published a work on community identification of directed networks, which is a generalization of the widely used community finding technique of modularity maximization in undirected networks. However, our inv...
متن کاملCommunity Structure Detection for Directed Networks through Modularity Optimisation
Networks constitute powerful means of representing various types of complex systems, where nodes denote the system entities and edges express the interactions between the entities. An important topological property in complex networks is community structure, where the density of edges within subgraphs is much higher than across different subgraphs. Each of these subgraphs forms a community (or ...
متن کاملLocal community extraction in directed networks
Network is a simple but powerful representation of real-world complex systems. Network community analysis has become an invaluable tool to explore and reveal the internal organization of nodes. However, only a few methods were directly designed for community-detection in directed networks. In this article, we introduce the concept of local community structure in directed networks and provide a ...
متن کاملLocal structure of directed networks.
Previous work on undirected small-world networks established the paradigm that locally structured networks tend to have a high density of short loops. On the other hand, many realistic networks are directed. Here we investigate the local organization of directed networks and find, surprisingly, that real networks often have very few short loops as compared to random models. We develop a theory ...
متن کاملDetecting community structure in networks
There has been considerable recent interest in algorithms for finding communities in networks— groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2008
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.100.118703